A Mechanism for Reasoning over Defeasible Preferences in Arg2P

This paper introduces argumentation over defeasible preferences in Arg2P, an argumentation framework based on logic programming. A computational mechanism is first implemented in Arg2P according to Dung’s defeasible preference model, then generalised to enable arbitrary preference relations over arguments

Burden of persuasion in argumentation: A meta-argumentation approach

This paper examines the view of the burden of persuasion as meta argument and elaborates the meta-argumentative aspects of a burden-of-persuasion semantics in argumentation. An argumentation framework composed of a meta level (dealing with the burden) and an object level (dealing with standard arguments) is proposed and discussed, and its equivalence with the burden-of-persuasion model in argumentation is proved. Finally, a computationally-feasible implementation of the meta-argumentation approach is presented

Burden of Persuasion in Meta-argumentation

This work defines a burden of persuasion meta-argumentation model interpreting the burden as a set of meta-arguments. Bimodal graphs are exploited to define a meta level (dealing with the burden) and an object level (dealing with standard arguments). Finally, an example in the law domain addressing the problem of burden inversion is discussed in detail

Burden of Persuasion: A Meta-argumentation Approach

This work defines a burden of persuasion meta-argumentation model interpreting burden as a set of meta-arguments. Bimodal graphs are exploited to define a meta level (dealing with the burden) and an object level (dealing with standard arguments). A novel technological reification of the model supporting the burden inversion mechanism is presented and discussed

Arg-tuProlog: A tuProlog-based argumentation framework

Over the last decades, argumentation has become increasingly central as a frontier research within artificial intelligence (AI), especially around the notions of interpretability and explainability, which are more and more required within AI applications. In this paper we present the first prototype of Arg-tuProlog, a logic-based argumentation tool built on top of the tuProlog system. In particular, Arg-tuProlog enables defeasible reasoning and argumentation, and deals with priorities over rules. It also includes a formal method for dealing with burden of proof (burden of persuasion). Being lightweight and compliant to the requirements for micro-intelligence, Arg-tuProlog is perfectly suited for injecting argumentation into distributed pervasive systems

Burden of persuasion in argumentation : a meta-argumentation approach

Published online: 14 February 2022This paper examines the view of the burden of persuasion as meta argument and elaborates the meta-argumentative aspects of a burden-of-persuasion semantics in argumentation. An argumentation framework composed of a meta level (dealing with the burden) and an object level (dealing with standard arguments) is proposed and discussed, and its equivalence with the burden-of-persuasion model in argumentation is proved. Finally, a computationally-feasible implementation of the meta-argumentation approach is presented

Burden of persuasion : a meta-argumentation approach

Published: May 2023This work defines a burden of persuasion meta-argumentation model interpreting burden as a set of meta-arguments. Bimodal graphs are exploited to define a meta level (dealing with the burden) and an object level (dealing with standard arguments). A novel technological reification of the model supporting the burden inversion mechanism is presented and discussed.The work has been supported by the “CompuLaw” project, funded by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No.833647)